Ant colony optimisation for solving real-world pickup and delivery problems with hard time windows
نویسندگان
چکیده
منابع مشابه
Solving the Vehicle Routing Problem with Simultaneous Pickup and Delivery by an Effective Ant Colony Optimization
One of the most important extensions of the capacitated vehicle routing problem (CVRP) is the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) where customers require simultaneous delivery and pick-up service. In this paper, we propose an effective ant colony optimization (EACO) which includes insert, swap and 2-Opt moves for solving VRPSPD that is different with common an...
متن کاملsolving the vehicle routing problem with simultaneous pickup and delivery by an effective ant colony optimization
one of the most important extensions of the capacitated vehicle routing problem (cvrp) is the vehicle routing problem with simultaneous pickup and delivery (vrpspd) where customers require simultaneous delivery and pick-up service. in this paper, we propose an effective ant colony optimization (eaco) which includes insert, swap and 2-opt moves for solving vrpspd that is different with common an...
متن کاملComparing Genetic Algorithms and Simulated Annealing for Solving the Pickup and Delivery Problem with Time Windows
Solving the Vehicle Routing Problem (VRP) and its related variants is significant for optimizing logistic planning. One important variant of the VRP is the Pickup and Delivery Problem with Time Windows (PDPTW), where it is assumed that a client may request one of two service types, a pickup or a delivery. It is required to find a set of minimum cost routes for a fleet of vehicles, while observi...
متن کاملInvestigating Genetic Algorithms for Solving the Multiple Vehicle Pickup and Delivery Problem with Time Windows
One important problem in transportation and logistics systems is the Multiple Vehicle Pickup and Delivery Problem with Time Windows (MV-PDPTW). The problem deals with a number of pickup and delivery (P&D) requests that should be served by a fleet of vehicles. A delivery location must be served after its corresponding pickup location. The vehicle’s journey should start and end at a central depot...
متن کاملA new insertion-based construction heuristic for solving the pickup and delivery problem with time windows
In this paper we present a new insertion-based construction heuristic to solve the multivehicle pickup and delivery problem with time windows. The new heuristic does not only consider the classical incremental distance measure in the insertion evaluation criteria but also the cost of reducing the time window slack due to the insertion. We also present a non-standard measure, Crossing Length Per...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: World Review of Intermodal Transportation Research
سال: 2020
ISSN: 1749-4729,1749-4737
DOI: 10.1504/writr.2020.106451